runtime._type.size (field)
148 uses
runtime (current package)
alg.go#L147: switch t.size {
alg.go#L153: return memhash(p, h, t.size)
alg.go#L176: h = typehash(a.elem, add(p, i*a.elem.size), h)
cgocall.go#L465: p = add(p, at.elem.size)
cgocall.go#L514: p = add(p, st.elem.size)
cgocheck.go#L98: cgoCheckTypedBlock(typ, p, 0, typ.size)
cgocheck.go#L99: p = add(p, typ.size)
cgocheck.go#L229: if off < at.elem.size {
cgocheck.go#L232: src = add(src, at.elem.size)
cgocheck.go#L234: if skipped > at.elem.size {
cgocheck.go#L235: skipped = at.elem.size
cgocheck.go#L237: checked := at.elem.size - skipped
cgocheck.go#L247: if off < f.typ.size {
cgocheck.go#L250: src = add(src, f.typ.size)
cgocheck.go#L252: if skipped > f.typ.size {
cgocheck.go#L253: skipped = f.typ.size
cgocheck.go#L255: checked := f.typ.size - skipped
chan.go#L76: if elem.size >= 1<<16 {
chan.go#L83: mem, overflow := math.MulUintptr(elem.size, uintptr(size))
chan.go#L110: c.elemsize = uint16(elem.size)
chan.go#L116: print("makechan: chan=", c, "; elemsize=", elem.size, "; dataqsiz=", size, "\n")
chan.go#L341: typeBitsBulkBarrier(t, uintptr(dst), uintptr(src), t.size)
chan.go#L344: memmove(dst, src, t.size)
chan.go#L352: typeBitsBulkBarrier(t, uintptr(dst), uintptr(src), t.size)
chan.go#L353: memmove(dst, src, t.size)
checkptr.go#L25: if checkptrStraddles(p, n*elem.size) {
heapdump.go#L196: dumpint(uint64(t.size))
iface.go#L326: msanread(v, t.size)
iface.go#L329: asanread(v, t.size)
iface.go#L331: x := mallocgc(t.size, t, true)
iface.go#L341: msanread(v, t.size)
iface.go#L344: asanread(v, t.size)
iface.go#L347: x := mallocgc(t.size, t, false)
iface.go#L348: memmove(x, v, t.size)
malloc.go#L1118: if dataSize > typ.size {
malloc.go#L1123: scanSize = dataSize - typ.size + typ.ptrdata
malloc.go#L1259: return mallocgc(typ.size, typ, true)
malloc.go#L1264: return mallocgc(typ.size, typ, true)
malloc.go#L1269: return mallocgc(typ.size, typ, true)
malloc.go#L1275: return mallocgc(typ.size, typ, true)
malloc.go#L1277: mem, overflow := math.MulUintptr(typ.size, uintptr(n))
map.go#L305: mem, overflow := math.MulUintptr(uintptr(hint), t.bucket.size)
map.go#L355: sz := t.bucket.size * nbuckets
map.go#L358: nbuckets = up / t.bucket.size
map.go#L369: size := t.bucket.size * nbuckets
map.go#L403: msanread(key, t.key.size)
map.go#L406: asanread(key, t.key.size)
map.go#L464: msanread(key, t.key.size)
map.go#L467: asanread(key, t.key.size)
map.go#L589: msanread(key, t.key.size)
map.go#L592: asanread(key, t.key.size)
map.go#L703: msanread(key, t.key.size)
map.go#L706: asanread(key, t.key.size)
map.go#L752: memclrHasPointers(k, t.key.size)
map.go#L758: memclrHasPointers(e, t.elem.size)
map.go#L760: memclrNoHeapPointers(e, t.elem.size)
map.go#L1296: if t.key.size > maxKeySize && (!t.indirectkey() || t.keysize != uint8(goarch.PtrSize)) ||
map.go#L1297: t.key.size <= maxKeySize && (t.indirectkey() || t.keysize != uint8(t.key.size)) {
map.go#L1300: if t.elem.size > maxElemSize && (!t.indirectelem() || t.elemsize != uint8(goarch.PtrSize)) ||
map.go#L1301: t.elem.size <= maxElemSize && (t.indirectelem() || t.elemsize != uint8(t.elem.size)) {
map.go#L1310: if t.key.size%uintptr(t.key.align) != 0 {
map.go#L1313: if t.elem.size%uintptr(t.elem.align) != 0 {
map_fast32.go#L312: memclrHasPointers(e, t.elem.size)
map_fast32.go#L314: memclrNoHeapPointers(e, t.elem.size)
map_fast64.go#L314: memclrHasPointers(e, t.elem.size)
map_fast64.go#L316: memclrNoHeapPointers(e, t.elem.size)
map_faststr.go#L340: memclrHasPointers(e, t.elem.size)
map_faststr.go#L342: memclrNoHeapPointers(e, t.elem.size)
mbarrier.go#L171: memmove(dst, src, typ.size)
mbarrier.go#L173: cgoCheckMemmove(typ, dst, src, 0, typ.size)
mbarrier.go#L184: msanwrite(dst, typ.size)
mbarrier.go#L185: msanread(src, typ.size)
mbarrier.go#L188: asanwrite(dst, typ.size)
mbarrier.go#L189: asanread(src, typ.size)
mbarrier.go#L262: racewriterangepc(dstPtr, uintptr(n)*typ.size, callerpc, pc)
mbarrier.go#L263: racereadrangepc(srcPtr, uintptr(n)*typ.size, callerpc, pc)
mbarrier.go#L266: msanwrite(dstPtr, uintptr(n)*typ.size)
mbarrier.go#L267: msanread(srcPtr, uintptr(n)*typ.size)
mbarrier.go#L270: asanwrite(dstPtr, uintptr(n)*typ.size)
mbarrier.go#L271: asanread(srcPtr, uintptr(n)*typ.size)
mbarrier.go#L286: size := uintptr(n) * typ.size
mbarrier.go#L288: pwsize := size - typ.size + typ.ptrdata
mbarrier.go#L300: return slicecopy(dst.array, dst.len, src.array, src.len, elemType.size)
mbarrier.go#L318: memclrNoHeapPointers(ptr, typ.size)
mbitmap.go#L719: if typ.size != size {
mbitmap.go#L720: println("runtime: typeBitsBulkBarrier with type ", typ.string(), " of size ", typ.size, " but memory size", size)
mbitmap.go#L876: if typ.size == goarch.PtrSize {
mbitmap.go#L899: if typ.size != 2*goarch.PtrSize || typ.kind&kindGCProg != 0 {
mbitmap.go#L900: print("runtime: heapBitsSetType size=", size, " but typ.size=", typ.size, " gcprog=", typ.kind&kindGCProg != 0, "\n")
mbitmap.go#L925: if typ.size == 2*goarch.PtrSize {
mbitmap.go#L926: print("runtime: heapBitsSetType size=", size, " but typ.size=", typ.size, "\n")
mbitmap.go#L930: if typ.size == goarch.PtrSize {
mbitmap.go#L934: print("runtime: heapBitsSetType size=", size, " typ.size=", typ.size, "but *typ.gcdata", *typ.gcdata, "\n")
mbitmap.go#L1021: heapBitsSetTypeGCProg(h, typ.ptrdata, typ.size, dataSize, size, addb(typ.gcdata, 4))
mbitmap.go#L1072: if typ.size < dataSize {
mbitmap.go#L1093: nb = typ.size / goarch.PtrSize
mbitmap.go#L1125: endnb = typ.size/goarch.PtrSize - n*8
mbitmap.go#L1134: if typ.size == dataSize {
mbitmap.go#L1141: nw = ((dataSize/typ.size-1)*typ.size + typ.ptrdata) / goarch.PtrSize
mbitmap.go#L1418: println("ended at wrong bitmap byte for", typ.string(), "x", dataSize/typ.size)
mbitmap.go#L1419: print("typ.size=", typ.size, " typ.ptrdata=", typ.ptrdata, " dataSize=", dataSize, " size=", size, "\n")
mbitmap.go#L1431: ndata := typ.size / goarch.PtrSize
mbitmap.go#L1432: count := dataSize / typ.size
mbitmap.go#L1433: totalptr := ((count-1)*typ.size + typ.ptrdata) / goarch.PtrSize
mbitmap.go#L1451: println("mismatch writing bits for", typ.string(), "x", dataSize/typ.size)
mbitmap.go#L1452: print("typ.size=", typ.size, " typ.ptrdata=", typ.ptrdata, " dataSize=", dataSize, " size=", size, "\n")
mbitmap.go#L1977: n := (*ptrtype)(unsafe.Pointer(t)).elem.size
mbitmap.go#L1989: n := (*ptrtype)(unsafe.Pointer(t)).elem.size
mbitmap.go#L2029: n := (*ptrtype)(unsafe.Pointer(t)).elem.size
mfinal.go#L376: if ot.elem == nil || ot.elem.ptrdata != 0 || ot.elem.size >= maxTinySize {
mfinal.go#L427: nret = alignUp(nret, uintptr(t.align)) + uintptr(t.size)
select.go#L404: msanread(cas.elem, c.elemtype.size)
select.go#L406: msanwrite(cas.elem, c.elemtype.size)
select.go#L411: asanread(cas.elem, c.elemtype.size)
select.go#L413: asanwrite(cas.elem, c.elemtype.size)
select.go#L429: msanwrite(cas.elem, c.elemtype.size)
select.go#L432: asanwrite(cas.elem, c.elemtype.size)
select.go#L455: msanread(cas.elem, c.elemtype.size)
select.go#L458: asanread(cas.elem, c.elemtype.size)
select.go#L496: msanread(cas.elem, c.elemtype.size)
select.go#L499: asanread(cas.elem, c.elemtype.size)
slice.go#L42: tomem, overflow = math.MulUintptr(et.size, uintptr(tolen))
slice.go#L46: copymem = et.size * uintptr(fromlen)
slice.go#L51: tomem = et.size * uintptr(tolen)
slice.go#L89: mem, overflow := math.MulUintptr(et.size, uintptr(cap))
slice.go#L96: mem, overflow := math.MulUintptr(et.size, uintptr(len))
slice.go#L125: mem, overflow := math.MulUintptr(et.size, uintptr(len))
slice.go#L147: if checkptrStraddles(ptr, uintptr(len64)*et.size) {
slice.go#L169: racereadrangepc(old.array, uintptr(old.len*int(et.size)), callerpc, abi.FuncPCABIInternal(growslice))
slice.go#L172: msanread(old.array, uintptr(old.len*int(et.size)))
slice.go#L175: asanread(old.array, uintptr(old.len*int(et.size)))
slice.go#L182: if et.size == 0 {
slice.go#L220: case et.size == 1:
slice.go#L226: case et.size == goarch.PtrSize:
slice.go#L232: case isPowerOfTwo(et.size):
slice.go#L236: shift = uintptr(sys.Ctz64(uint64(et.size))) & 63
slice.go#L238: shift = uintptr(sys.Ctz32(uint32(et.size))) & 31
slice.go#L246: lenmem = uintptr(old.len) * et.size
slice.go#L247: newlenmem = uintptr(cap) * et.size
slice.go#L248: capmem, overflow = math.MulUintptr(et.size, uintptr(newcap))
slice.go#L250: newcap = int(capmem / et.size)
slice.go#L282: bulkBarrierPreWriteSrcOnly(uintptr(p), uintptr(old.array), lenmem-et.size+et.ptrdata)
stack.go#L1380: off: -int32(alignUp(abiRegArgsType.size, 8)), // It's always the highest address local.
stack.go#L1381: size: int32(abiRegArgsType.size),
type.go#L35: size uintptr